Solving 10385 - Duathlon (Ternary search)
[andmenj-acm.git] / 10090 - Marbles / random.cpp
blob92be98dff779dbc09391e6cc41cafcb2ff0eb3dc
1 /*
2 Problem:
3 Author: Andrés Mejía-Posada
4 (http://blogaritmo.factorcomun.org)
6 */
8 using namespace std;
9 #include <algorithm>
10 #include <iostream>
11 #include <iterator>
12 #include <sstream>
13 #include <fstream>
14 #include <cassert>
15 #include <climits>
16 #include <cstdlib>
17 #include <cstring>
18 #include <string>
19 #include <cstdio>
20 #include <vector>
21 #include <cmath>
22 #include <queue>
23 #include <deque>
24 #include <stack>
25 #include <map>
26 #include <set>
28 #define D(x) cout << #x " is " << x << endl
30 int main(){
31 int n = 100;
32 int mod = 10;
33 for(int i=0; i<100; ++i){
34 printf("%d\n%d %d\n%d %d\n", random()%mod+1, random()%mod+1, random()%mod+1, random()%mod+1, random()%mod+1);
37 printf("0\n");
38 return 0;